Color Edge Detection Using the Minimal Spanning Tree Algorithm and Vector Order Statistic
نویسندگان
چکیده
The edge detection approach based on minimal spanning tree and vector order statistic is proposed. Minimal spaning tree determined ranking from the observations and identified classes that have similarities. Vector Order Statistic view a color image as a vector field and employ as a distance metrics. Experiment of edge detection on several images show that the result of minimal spanning tree is smoother and more computational time comparing to that vector order statistic.
منابع مشابه
Color edge detection using the minimal spanning tree
In this study, the edge detection task in vector-valued images is examined as a clustering problem. Using samples within a data window, the minimal spanning tree (MST) provides the ordering of multivariate observations and facilitates the identification of similar classes. The edge detector parameters like edge strength, type and orientation are subsequently determined from the clustered data. ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملOn the bicriterion - minimal cost/minimal label - spanning tree problem
We deal with a bicriterion spanning tree problem relevant in some application fields such as telecommunication networks or electric networks. Each edge is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the spanning tree (the summation of its edge costs), while the second intends to get the solution with a minimum number of dif...
متن کاملDetection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012